Development of a Modified Ant Colony Algorithm for Order Scheduling in Food Processing Plants
نویسندگان
چکیده
A modified ant colony algorithm has been developed, which, unlike its classical form, when applied to solve the problem of order fulfillment scheduling, allows us reduce time by using local optimization approaches. The developed contains an additional improvement methods, which reduces find a solution. proposed algorithm, applied, for reconfiguration plans while reducing search optimum almost 20% compared other versions algorithms.
منابع مشابه
Ant Colony Algorithm for Surgery Scheduling Problem
Considering the complete process of surgery including the preoperative and postoperative stages, multiple resource constraints involved and the integration of surgical upstream and downstream resources, surgery scheduling was described as an extended multi-resource constrained flexible job-shop scheduling problem and an optimization approach was proposed based on an improved ant colony algorith...
متن کاملMulti-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm
In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...
متن کاملA Hybrid Ant Colony Optimization Algorithm for Software Project Scheduling
The extraction of comprehensible knowledge is one of the major challenges in many domains. In this concept, an ant programming (AP) framework, which is capable of mining classification rules easily comprehensible by humans, and, therefore, capable of supporting expert-domain decisions, is presented. The algorithm proposed, called grammar based ant programming (GBAP), is the first AP algorithm d...
متن کاملA modified ant colony optimization algorithm for virtual network embedding
Traditional Internet architecture is far too rigid for use with large numbers of network applications with different quality of service requirements. One new and promising approach to overcome the rigidity is network virtualization (NV), which allows multiple heterogeneous virtual networks to coexist on a shared substrate network (SN). However, one of the key problems for NV is the virtual netw...
متن کاملA Modified Ant Colony Algorithm to the P| Prec| Cmax Scheduling Problem: A Comparative Study
This paper investigates a comparative study which addresses the P/prec/Cmax scheduling problem, a notable NP-hard benchmark. MLP_SACS, a modified ant colony algorithm, is used to solve it. Its application provides us a better job allocation to machines. In front of each machine, the jobs are performed with three priority rules, the longest path (LP), a modified longest path (MLP) and a maximum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automation, Mobile Robotics & Intelligent Systems
سال: 2023
ISSN: ['1897-8649', '2080-2145']
DOI: https://doi.org/10.14313/jamris/1-2022/6